Robustness of Finite State Automata
نویسنده
چکیده
The classical robust control deals with systems which can be approximated by nite order linear time-invariant (LTI) models, uses integral constraints, such as induced gain bounds, to assess robustness with respect to the error of such approximation, and employs H-In nity optimization to design robust linear controllers. In this paper, a parallel approach is developed, in which nite state stochastic automata play the role of LTI models. Analogs of the KalmanYakubovich-Popov Lemma, the S-procedure losslessness theorem, and H-In nity design are derived. Introduction Robustness analysis and optimization is a major source of eÆcient design tools for the modern control engineer. The classical robust control deals with systems which can be approximated by LTI models. The di ernece between such approximations and the true system dynamics is described by integral constraints, such as induced gain bounds or Integral Quadratic Constraints [1]. Constructively veri able conditions of stability and performance, such as the small gain theorem, are used to assess stability and performance of systems de ned by nominal LTI dynamics and integral constraints. Ultimately, the task of robust LTI feedback design is reduced to induced gain minimization, such as H-In nity optimization, which employs extensively quadratic Lyapunov functions. While being the dominant tool for computer-aided design and analysis of systems modeled by near-linear di erential equations, this framework fails to provide adequate treatment in the case of hybrid systems, i.e. systems which combine continuous and discrete state dynamics. A major objective of the paper is creation of an alternative robust control framework in which nite state stochastic automata serve as a basic system model. Systems under consideration are represented as interconnections of \nominal" controlled nite state automata and the \uncertain feedback" systems described by integral constraints representing modeling error. Lyapunov functions are used for analysis and design. The theorems presented in this paper are quite elementary, and can be viewed as simpli ed versions of the standard results of dynamic programming [2]. However, they highlight a potentially powerful framework for nonlinear 1 to appear in the Proceedings of Mohammed Dahleh memorial symphosium. Email: [email protected]. This work was supported by NSF, AFOSR, and DARPA feedback design. In this framework, one has to start with nding a reduced model of the original system. 1 System Models In this section, basic principles of system modeling and design using nite state stochastic automata and integral constraints are introduced. 1.1 Finite Alphabet Feedback Design This subsection contains motivation for using the uncertain nite state automata models as de ned later in the paper. Observer-Based Feedback. Our ultimate goal is to develop tools for optimizing the controller K in the feedback loop shown on Figure 1, where P
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملLipschitz Robustness of Finite-state Transducers
We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity — a transducer is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions. We show that K-r...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملOdin's Runes: A Rule Language for Information Extraction
Odin is an information extraction framework that applies cascades of finite state automata over both surface text and syntactic dependency graphs. Support for syntactic patterns allow us to concisely define relations that are otherwise difficult to express in languages such as Common Pattern Specification Language (CPSL), which are currently limited to shallow linguistic features. The interacti...
متن کاملA finite-state approach to shallow parsing and grammatical functions annotation of German
Chapter 2 gives an introduction to the nature and architecture of our parser. Section 2.1 presents finite-state automata (FSAs) as a parsing model and illustrates the motivation for using this very model for the parser at hand. Section 2.2 explains the motivation for and the main features of the parsing approach used in the dissertation at hand, namely the annotation of constituent structures a...
متن کامل